Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms
نویسنده
چکیده
A b s t r a c t . Crystal lattices are infinite periodic graphs that occur naturally in a variety of geometries and which are of fundamental importance in polymer science. Discrete models of protein folding use crystal lattices to define the space of protein conformations. Because various crystal lattices provide discretizations of the same physical phenomenon, it is reasonable to expect that there will exist "invariants" across lattices that define fundamental properties of the protein folding process; an invariant defines a property that transcends particular lattice formulations. This paper identifies two classes of invariants, defined in terms of sublattices that are related to the design of algorithms for the struct u r e prediction problem. The first class of invariants is used to define a master approximation algorithm for which provable performance guarantees exist. This algorithm can be applied to generalizations of the hydrophobic-hydrophilic model that have lattices other than the cubic lattice, including most of the crystal lattices commonly used in protein folding lattice models. The second class of invariants applies to a related lattice model. Using these invariants, we show that for this model the structure prediction problem is intractable across a variety of threedimensional lattices. It turns out that these two classes of invariants are respectively sublattices of the twoand three-dimensional square lattice. As the square lattices are the standard lattices used in empirical protein folding studies, our results provide a rigorous confirmation of the ability of these lattices to provide insight into biological phenomenon. Our results are the first in the literature that identify algorithmic paradigms for the protein structure prediction problem that transcend particular lattice formulations.
منابع مشابه
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract)
Crystal lattices are in nite periodic graphs that occur naturally in a variety of geometries and which are of fundamental importance in polymer science. Discrete models of protein folding use crystal lattices to de ne the space of protein conformations. Because various crystal lattices provide discretizations of the same physical phenomenon, it is reasonable to expect that there will exist \inv...
متن کاملStudies of protein designability using reduced models
One the most important problems in computational structural biology is protein designability, that is, why protein sequences are not random strings of amino acids but instead show regular patterns that encode protein structures. Many previous studies that have attempted to solve the problem have relied upon reduced models of proteins. In particular, the 2D square and the 3D cubic lattices toget...
متن کاملA New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem
The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated and applied to address the problem of solving the abinitio protein structure prediction problem—i.e., predicting the 3D structure of a protein from its amino acid sequence. Experimental results demonstrate that our novel approach ...
متن کاملBackbones of folded proteins reveal novel invariant amino acid neighborhoods.
Folding of naturally occurring proteins has eluded a universal molecular level explanation till date. Rather, there is an abundance of diverse views on dominant factors governing protein folding. Through rigorous analyses of several thousand crystal structures, we observe that backbones of folded proteins display some remarkable invariant features. Folded proteins are characterized by spatially...
متن کامل